Page-based optimistic concurrency control for memory-mapped persistent object systems

New app1ication.a th.at support cooperative work of users on. distributed computers often share perai9ten.t data atru.cturea that con,tain poinders. For th.eae app1ication.a. th,e un.derlyin,g system, often wea th,e “page aenler” arch,itecture. in which th,e persistent data are ah.ipped from th.e server on a page basis, ad clients cache th,e pagea for object-grain accesses. In this pagegrain. en.viron.m.en,t. conventional concurrenxy control ach.em,ea do not work as well as they do in the objectgrain. en.viron.m.en.t for buain,eaa application.8, because of th.eir lack of eficiency and/or correctness. The twoph,aae lockirtg ach,em,e an.d tim‘e9tam.p 0rderin.g ach,eme au#er from, fiequ.en,t lock contention. (false) deadlocks, and/or frequen.t transaction restarts. Existing optim.iatic ach,em.ea aom.etim.ea provide inconsistent views of the peraiatend storage to tran,aactiona that are to be aborted. This paper proposes a novel concurrency con.trol 9ch.em.e. called “page-baaed versioned optimistic” 9ch.em.e. suitable for serialization of distributed cooperative a.pplicationa with. page-grain, accesses. The optim.iatic sch.em.e with, versionin,g avoids lock con,tention, com.m.ita all read-on,ly tranaactiorza. and provides consisted views of th.e persistent storage even to tranaaction.a th.at are to be aborted. The 9ch.em.e is able to be im.plem.ented eficiently in distributed systems as well as in, cen.tralited ayatema.